An Interior-Point Algorithm for Nonlinear Minimax Problems
نویسندگان
چکیده
منابع مشابه
Improved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملAn interior point algorithm for continuous minimax: implementation and computation
In this paper we propose an algorithm for the constrained continuous minimax problem. The algorithm, motivation and numerical experience are reported in this paper. Theoretical properties, and the convergence of the proposed method are discussed in a separate paper[31]. The algorithm uses quasi–Newton search direction, based on sub–gradient information, conditional on maximizers. The initial pr...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملA New Interior Point Algorithm for Nonlinear Complementarity Problems
1. Abstract The complementarity problem consists in finding x ∈ IR such that x ≥ 0 , F (x) ≥ 0 and xF (x) = 0, where F : IR → IR. Complementarity problems are involved in several applications in engineering, economy and different branches of physics . We mention contact problems and dynamics of multiple bodies systems in solid mechanics. In this paper we present a new feasible interior point al...
متن کاملimproved infeasible-interior-point algorithm for linear complementarity problems
we present a modified version of the infeasible-interior- we present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by mansouri et al. (nonlinear anal. real world appl. 12(2011) 545--561). each main step of the algorithm consists of a feasibility step and several centering steps. we use a different feasibility step, which targ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2009
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-009-9599-z